The multi-trip container drayage problem with synchronization for efficient empty containers re-usage

We study a typical daily drayage problem concerning the last-mile logistics at seaports for inland container supply chains. A set of trucks available an terminal must fulfil shippers’ requests transporting containers within time windows and, to do so, can perform multiple trips. request may entail picking up or delivering either premises, seaport. Demand empty be satisfied by using limited stock terminal, street-turning or, ultimately, retrieving them local depot empties resulting in extra mileage. Hence, minimization routing costs also entails synchronizing trucks’ trips that retrieve and add avoid unnecessary visits depot. After modelling mathematically, we develop exact column-and-row generation approach embedded branch-and-price framework. To accelerate solving process pricing problem, propose effective strategies combining tailored algorithms. These well on adapted Solomon’s instances 100 nodes against standard branch-and-cut solver. Finally, experiments real-world instances, inspired case Port Rotterdam region, provide insights into current planning practices.